Electric Boolean Games: Redistribution Schemes for Resource-Bounded Agents
نویسندگان
چکیده
In Boolean games, agents uniquely control a set of propositional variables, and aim at achieving a goal formula whose realisation might depend on the choices the other agents make with respect to the variables they control. We consider the case in which assigning a value to propositional variables incurs a cost, and moreover, we assume agents to be restricted in their choice of assignments by an initial endowment: they can only make choices with a lower cost than this endowment. We then consider the possibility that endowments can be redistributed among agents. Different redistributions may lead to Nash equilibrium outcomes with very different properties, and so certain redistributions may be considered more attractive than others. In this context we study centralised redistribution schemes, where a system designer is allowed to redistribute the initial energy endowment among the agents in order to achieve desirable systemic properties. We also show how to extend this basic model to a dynamic variant in which an electric Boolean game takes place over a series of rounds.
منابع مشابه
Rational verification in Iterated Electric Boolean Games
Electric boolean games are compact representations of games where the players have qualitative objectives described by LTL formulae and have limited resources. We study the complexity of several decision problems related to the analysis of rationality in electric boolean games with LTL objectives. In particular, we report that the problem of deciding whether a profile is a Nash equilibrium in a...
متن کاملDesigning incentives for Boolean games
Boolean games are a natural, compact, and expressive class of logicbased games, in which each player exercises unique control over some set of Boolean variables, and has some logical goal formula that it desires to be achieved. A player’s strategy set is the set of all possible valuations that may be made to its variables. A player’s goal formula may contain variables controlled by other agents...
متن کاملTowards tractable Boolean games
Boolean games are a compact and expressive class of games, based on propositional logic. However, Boolean games are computationally complex: checking for the existence of pure Nash equilibria in Boolean games is Σp2-complete, and it is co-NP-complete to check whether a given outcome for a Boolean game is a pure Nash equilibrium. In this paper, we consider two possible avenues to tractability in...
متن کاملAdaptive Boolean networks and minority games with time-dependent capacities.
In this paper we consider a network of Boolean agents that compete for a limited resource. The agents play the so called generalized minority game where the capacity level is allowed to vary externally. We study the properties of such a system for different values of the mean connectivity K of the network, and show that the system with K=2 shows a high degree of coordination for relatively larg...
متن کاملDecentralized Computation of Pareto Optimal Pure Nash Equilibria of Boolean Games with Privacy Concerns
In Boolean games, agents try to reach a goal formulated as a Boolean formula. These games are attractive because of their compact representations. However, few methods are available to compute the solutions and they are either limited or do not take privacy or communication concerns into account. In this paper we propose the use of an algorithm related to reinforcement learning to address this ...
متن کامل